EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K2,n
نویسندگان
چکیده
منابع مشابه
Exact Weight Perfect Matching of Bipartite Graph is NP - Complete ∗
This paper proves that the complexity of exact weight perfect matching problem is NPcomplete by reduction from the good perfect matching problem. Following this result, the other two open problems DNA sequence analysis and discrete min-max assignment problems are proven to be NPcomplete.
متن کاملOn the parameter μ21 of a complete bipartite graph
A proper edge t-coloring of a graph G is a coloring of edges of G with colors 1, 2, ..., t such that all colors are used, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex x is called a spectrum of x. An arbitrary nonempty subset of consecutive integers is called an interval. Suppose that all edges of a graph G are colored in the game of Alice a...
متن کاملOn Component Order Edge Connectivity Of a Complete Bipartite Graph
The traditional parameter used as a measure of vulnerability of a network modeled by a graph with perfect nodes and edges that may fail is the edge connectivity λ. Of course , () p q K p λ = where p q ≤. In that case, failure of the network simply means that the surviving subgraph becomes disconnected upon the failure of individual edges. If, instead, failure of the network is defined to mean t...
متن کاملEvery Graph is a Self - Similar Set
In this paper we prove that every graph (in particular S1) is a selfsimilar space and that [0, 1] is a self-similar set that is not the product of topological spaces, answering two questions posed by C. Ruiz and S. Sabogal in [6].
متن کاملHypotheses generation using link prediction in a bipartite graph
The large volume of scientific publications is likely to have hidden knowledge that can be used for suggesting new research topics. We propose an automatic method that is helpful for generating research hypotheses in the field of physics using the massive number of physics journal publications. We convert the text data of titles and abstract sections in publications to a bipartite graph, extrac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Korean Journal of Mathematics
سال: 2012
ISSN: 1976-8605
DOI: 10.11568/kjm.2012.20.4.403